منابع مشابه
On Large Vertex Symmetric 2-Reachable Digraphs
We are interested in the construction of the largest possible vertex symmetric digraphs with the property that between any two vertices there is a walk of length two (that is, they are 2-reachable). Other than a theoretical interest, these digraphs and their generalizations may be used as models of interconnection networks for implementing parallelism. In these systems many nodes are connected ...
متن کاملTranspose on vertex symmetric digraphs
In [2] (and earlier in [3]), we defined several global communication tasks (universal exchange, universal broadcast, universal summation) on directed or vertex symmetric networks. In that paper, we mainly focused on universal broadcast. In [4], we discussed universal sum. Here we continue this work and focus on universal exchange (transpose) in directed vertex symmetric graphs. Introduction. In...
متن کاملVertex-symmetric Digraphs with Small Diameter
There is increasing interest in the design of dense vertex-symmetric graphs and digraphs as models of interconnection networks for implementing parallelism. In these systems many nodes are connected with relatively few links and short paths between them and each node may execute, without modifications, the same communication software. In this paper we give new families of dense vertex-symmetric...
متن کاملVertex Removable Cycles of Graphs and Digraphs
In this paper we defined the vertex removable cycle in respect of the following, if $F$ is a class of graphs(digraphs) satisfying certain property, $G in F $, the cycle $C$ in $G$ is called vertex removable if $G-V(C)in in F $. The vertex removable cycles of eulerian graphs are studied. We also characterize the edge removable cycles of regular graphs(digraphs).
متن کاملBlock Line Cut Vertex Digraphs of Digraphs
In this paper, the digraph valued function(digraph operator), namely the block line cut vertex digraph BLC(D) of a digraph D is defined, and the problem of reconstructing a digraph from its block line cut vertex digraph is presented. Outer planarity, maximal outer planarity, and minimally non-outer planarity properties of these digraphs are discussed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2009
ISSN: 0012-365X
DOI: 10.1016/j.disc.2008.01.045